An LP-Based Heuristic for Optimal Planning
نویسندگان
چکیده
One of the most successful approaches in automated planning is to use heuristic state-space search. A popular heuristic that is used by a number of state-space planners is based on relaxing the planning task by ignoring the delete effects of the actions. In several planning domains, however, this relaxation produces rather weak estimates to guide search effectively. We present a relaxation using (integer) linear programming that respects delete effects but ignores action ordering, which in a number of problems provides better distance estimates. Moreover, our approach can be used as an admissible heuristic for optimal planning.
منابع مشابه
Linear Programming for Heuristics in Optimal Planning
Many recent planning heuristics are based on LP optimization. However, planning experts mostly use LP solvers as a black box and it is often not obvious to them which LP techniques would be most suitable for their specific applications. To foster the communication between the planning and the optimization community, this paper gives an easily accessible overview over these recent LP-based heuri...
متن کاملFlow-Based Heuristics for Optimal Planning: Landmarks and Merges
We describe a flow-based heuristic for optimal planning that exploits landmarks and merges. The heuristic solves a linear programming (LP) problem that represents variables in SAS planning as a set of interacting network flow problems. The solution to the LP provides a reasonable admissible heuristic for optimal planning, but we improve it considerably by adding constraints derived from action ...
متن کاملLP-Based Heuristics for Cost-Optimal Planning
Many heuristics for cost-optimal planning are based on linear programming. We cover several interesting heuristics of this type by a common framework that fixes the objective function of the linear program. Within the framework, constraints from different heuristics can be combined in one heuristic estimate which dominates the maximum of the component heuristics. Different heuristics of the fra...
متن کاملOn a Practical, Integer-Linear Programming Model for Delete-Free Tasks and its Use as a Heuristic for Cost-Optimal Planning
We propose a new integer-linear programming model for the delete relaxation in cost-optimal planning. While a straightforward IP for the delete relaxation is impractical, our enhanced model incorporates variable reduction techniques based on landmarks, relevance-based constraints, dominated action elimination, immediate action application, and inverse action constraints, resulting in an IP that...
متن کاملA Practical, Integer-Linear Programming Model for the Delete-Relaxation in Cost-Optimal Planning
We propose a new integer-linear programming model for the delete relaxation in cost-optimal planning. While a naive formulation of the delete relaxation as IP is impractical, our model incorporates landmarks and relevance-based constraints, resulting in an IP that can be used to directly solve the delete relaxation. We show that our IP model outperforms the previous state-of-the-art solver for ...
متن کامل